Web Similarity Measurements Using Ant – Based Search Algorithm

نویسندگان

  • Georgios Kouzas
  • Eleftherios Kayafas
  • Vassili Loumos
چکیده

In this paper, a web search algorithm is proposed, which aims to enhance the amount of the relevant information in respect to a user’s query. The proposed algorithm is based on the Ant Colony Optimization algorithm (ACO), employing in parallel document similarity issues from the field of information retrieval. Ant Colony Optimization algorithms were inspired through the observation of ant colonies. In our approach, ants are used as agents through Internet, which are capable of collecting information in each node they visit and generate routing paths through the web. The term similarity [1] is used to describe documents with contiguous content

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Clustering web people search results using fuzzy ants

Person name queries often bring up web pages that correspond to individuals sharing the same name. The Web People Search (WePS) task consists of organizing search results for ambiguous person name queries into meaningful clusters, with each cluster referring to one individual. This paper presents a fuzzy ant based clustering approach for this multi-document person name disambiguation problem. T...

متن کامل

A Technique for Improving Web Mining using Enhanced Genetic Algorithm

World Wide Web is growing at a very fast pace and makes a lot of information available to the public. Search engines used conventional methods to retrieve information on the Web; however, the search results of these engines are still able to be refined and their accuracy is not high enough. One of the methods for web mining is evolutionary algorithms which search according to the user interests...

متن کامل

Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search

A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...

متن کامل

Spam Host Detection Using Ant Colony Optimization

Inappropriate effort of web manipulation or spamming in order to boost up a web page into the first rank of a search result is an important problem, and affects the efficiency of a search engine. This article presents a spam host detection approach. We exploit both content and link features extracting from hosts to train a learning model based on ant colony optimization algorithm. Experiments o...

متن کامل

Combining Harmony search algorithm and Ant Colony Optimization algorithm to increase the lifetime of Wireless Sensor Networks

Wireless Sensor Networks are the new generation of networks that typically are formed great numbers of nodes and the communications of these nodes are done as Wireless. The main goal of these networks is collecting data from neighboring environment of network sensors. Since the sensor nodes are battery operated and there is no possibility of charging or replacing the batteries, the lifetime of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006